The calculation of efficient high precision orbits by optimum matching of the formulation and numerical integrator

The development of improved computer algorithms is considered for calculating earth satellite orbital trajectories by optimum selection of the analytical method that minimizes the number of perturbative acceleration computations for a given accuracy. A variation of parameter algorithm considering the equation of motion for a satellite proved superior for the geosynchronous orbit

Mathematical theory of the Goddard trajectory determination system

Basic mathematical formulations depict coordinate and time systems, perturbation models, orbital estimation techniques, observation models, and numerical integration methods

Flight Mechanics/Estimation Theory Symposium

The conference emphasizes orbital position estimation and trajectory calculation methods that consider flight mechanical parameters

The motion of a satellite of the moon

Analytical solution for motion of lunar orbital satellit

Goddard trajectory determination subsystem: Mathematical specifications

The mathematical specifications of the Goddard trajectory determination subsystem of the flight dynamics system are presented. These specifications include the mathematical description of the coordinate systems, dynamic and measurement model, numerical integration techniques, and statistical estimation concepts

Optimization of a Fast-Pick Area in a Cosmetics Distribution Center

Fast-pick areas are commonly used in order picking warehouses to improve labor efficiency by concentrating picking activities within a compact area, thus minimizing the distance traveled by the pickers. One problem that must be solved when a fast-pick area is to be implemented is the so-called assignment-allocation problem. This deals with deciding which products should be assigned to the fast-pick area, and how much space should be allocated to these products. This research was motivated by the picking operation of a cosmetics distribution center where several fast-pick areas are in place. A mixed integer linear programming formulation is proposed for solving the variant of the assignment-allocation problem found in this company. Our computational experiments show that the proposed model is efficient for solving small yet realistic instances of the problem

Optimization of a Fast-Pick Area in Cosmetics Distribution Center

Poster 1